Analysis of Random Noise and Random Walk Algorithms
نویسندگان
چکیده
Random Noise and RandomWalk algorithms are local search strategies that have been used for the problem of satisfiability testing (SAT). We present a Markov-chain based analysis of the performance of these algorithms. The performance measures we consider are the probability of finding a satisfying assignment and the distribution of the best solution observed on a given SAT instance. The analysis provides exact statistics, but is restricted to small problems as it requires the storage and use of knowledge about the entire search space. We examine the effect of p, the probability of making non-greedy moves, on these algorithms and provide a justification for the practice of choosing this value empirically.
منابع مشابه
On Learning Thresholds of Parities and Unions of Rectangles in Random Walk Models
In a recent breakthrough, [Bshouty et al., 2005] obtained the first passivelearning algorithm for DNFs under the uniform distribution. They showed that DNFs are learnable in the Random Walk and Noise Sensitivity models. We extend their results in several directions. We first show that thresholds of parities, a natural class encompassing DNFs, cannot be learned efficiently in the Noise Sensitivi...
متن کاملua nt - p h / 04 09 12 7 v 1 20 S ep 2 00 4 Noise resistance of adiabatic quantum computation using random matrix theory
Besides the traditional circuit-based model of quantum computation, several quantum algorithms based on a continuous-time Hamiltonian evolution have recently been introduced, including for instance continuous-time quantum walk algorithms as well as adiabatic quantum algorithms. Unfortunately, very little is known today on the behavior of these Hamiltonian algorithms in the presence of noise. He...
متن کاملA PRELUDE TO THE THEORY OF RANDOM WALKS IN RANDOM ENVIRONMENTS
A random walk on a lattice is one of the most fundamental models in probability theory. When the random walk is inhomogenous and its inhomogeniety comes from an ergodic stationary process, the walk is called a random walk in a random environment (RWRE). The basic questions such as the law of large numbers (LLN), the central limit theorem (CLT), and the large deviation principle (LDP) are ...
متن کاملA Random Walk with Exponential Travel Times
Consider the random walk among N places with N(N - 1)/2 transports. We attach an exponential random variable Xij to each transport between places Pi and Pj and take these random variables mutually independent. If transports are possible or impossible independently with probability p and 1-p, respectively, then we give a lower bound for the distribution function of the smallest path at point log...
متن کاملA survey on random walk-based stochastic modeling in eukaryotic cell migration with emphasis on its application in cancer
Impairments in cell migration processes may cause various diseases, among which cancer cell metastasis, tumor angiogenesis, and the disability of immune cells to infiltrate into tumors are prominent ones. Mathematical modeling has been widely used to analyze the cell migration process. Cell migration is a complicated process and requires statistical methods such as random walk for proper analys...
متن کامل